Efficient computation of the Weighted Clustering Coefficient
نویسندگان
چکیده
منابع مشابه
Parallel Clustering Coefficient Computation using GPUs
Clustering coefficient is the measure of how tightly vertices are bounded in a network. The Triangle Counting problem is at the core of clustering coefficient computation. We present a new technique for implementing clustering coefficient algorithm on GPUs. It relies on neighbour list being sorted with respect to vertex ID. The algorithm can process very large graphs not seen in the literature ...
متن کاملGeneralizations of the clustering coefficient to weighted complex networks.
The recent high level of interest in weighted complex networks gives rise to a need to develop new measures and to generalize existing ones to take the weights of links into account. Here we focus on various generalizations of the clustering coefficient, which is one of the central characteristics in the complex network theory. We present a comparative study of the several suggestions introduce...
متن کاملWeighted Ensemble Clustering for Increasing the Accuracy of the Final Clustering
Clustering algorithms are highly dependent on different factors such as the number of clusters, the specific clustering algorithm, and the used distance measure. Inspired from ensemble classification, one approach to reduce the effect of these factors on the final clustering is ensemble clustering. Since weighting the base classifiers has been a successful idea in ensemble classification, in th...
متن کاملEfficient Link Prediction with Node Clustering Coefficient
Predicting missing links in incomplete complex networks efficiently and accurately is still a challenging problem. The recently proposed CAR (Cannistrai-Alanis-Ravai) index shows the power of local link/triangle information in improving link-prediction accuracy. With the information of level-2 links, which are links between common-neighbors, most classical similarity indices can be improved. Ne...
متن کاملSocial triangles and generalized clustering coefficient for weighted networks
In the context of expert systems approach, the problem of community detection can be afford as a clustering model for networks. In this respect, a way to measure the community structure is the clustering coefficient. Such a quantity is based on the number of existing triangles around the nodes over the theoretical ones. To the best of our knowledge, scarce attention has been paid to the fictiti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2016
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2016.1198281